a,b=*input(),
x=a in'ah'
y=b in'18'
print(8-x*3-y*3+x*y)#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int n,x, e, d, k, j, h, w, f, r, t, l, o, p, i1, i2,y;
char c[10000];
int main()
{
//ifstream cin("input.txt");
//ofstream cout("output.txt");
cin >> c;
if((c[0]=='a' or c[0]=='h') and (c[1]=='1' or c[1]=='8')) cout<<"3";
if((c[0]=='a' or c[0]=='h') and (c[1]!='1' and c[1]!='8')) cout<<"5";
if((c[0]!='a' and c[0]!='h') and (c[1]=='1' or c[1]=='8')) cout<<"5";
if((c[0]!='a' and c[0]!='h') and (c[1]!='1' and c[1]!='8')) cout<<"8";
return 0;
}
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |